K-Means based General Self-Organized Tree- Based Energy Balancing Routing Protocol for Wireless Sensor Networks

Wireless Sensor networks (WSN) is a system collection of huge number of low cost sensor nodes spread over the geographic area in order to sense the data. This network is used to collect data and transmit the messages to base station(sink). In earlier days, WSN has been received a tremendous concentration from academic, defence and industrial services etc. Yet, they have many different constraints, such as computational capabilities, storage capacity, energy supply etc. In order to overcome these problems and to improve the performance of network need not only to minimize total energy consumption but also to balance energy consumption and load in order to enhance network lifetime In recent years researchers have proposed many protocols such as LEACH, HEED, PEGASIS,TBC and PEDAP,GSTEB. In this research paper we propose, a kmeans based GSTEB routing protocol which organise network in to the form of clusters by using k-means clustering algorithm and then builds a routing tree by using a process where, for each round, BS selects a root node and broadcasts root coordinates to all sensor nodes in network. After that each node selects its parent. Thus k-GSTEB IS a dynamic protocol. The simulation results shows that the proposed approach performs better that other existing approaches. Keywords-Wireless Sensor Network, Routing, Network Lifetime, Clustering, balanced k-means algorithm, Tree Based Routing